import java.util.HashMap;
import java.util.Map;


public class Graph {

	public static final double INFINITY = Double.MAX_VALUE;
	private Map<String, Node> nodeMap = new HashMap<String, Node>();
	
	public void addEdge(String source, String dest, double cost, State sourceState, State destState)
	{
		Node n = getNode(source, sourceState);
		Node m = getNode(dest, destState);
		//n.adj.add(new Edge(m, cost));
	}
	
	public Node getNode(String name, State state)
	{
		Node n = (Node)nodeMap.get(name);
		if (n == null)
		{
			//n = new Node(name, state);
			nodeMap.put(name, n);
		}
		return n;
	}
}
